Relative node polynomials for plane curves
نویسنده
چکیده
We generalize the recent work of S. Fomin and G. Mikhalkin on polynomial formulas for Severi degrees. The degree of the Severi variety of plane curves of degree d and δ nodes is given by a polynomial in d , provided δ is fixed and d is large enough. We extend this result to generalized Severi varieties parametrizing plane curves that, in addition, satisfy tangency conditions of given orders with respect to a given line. We show that the degrees of these varieties, appropriately rescaled, are given by a combinatorially defined “relative node polynomial” in the tangency orders, provided the latter are large enough. We describe a method to compute these polynomials for arbitrary δ, and use it to present explicit formulas for δ ≤ 6. We also give a threshold for polynomiality, and compute the first few leading terms for any δ.
منابع مشابه
9 N ov 2 00 1 Node polynomials for families : results and examples
We continue the development of methods for enumerating nodal curves on smooth complex surfaces, stressing the range of validity. We illustrate the new methods in three important examples. First, for up to eight nodes, we confirm Göttsche's conjecture about plane curves of low degree. Second, we justify Vainsencher's enumeration of irreducible six-nodal plane curves on a general quintic threefol...
متن کاملOn the enumeration of complex plane curves with two singular points
We study equi-singular strata of curves with two singular points of prescribed types. The method of our previous work [Kerner04] is generalized to this case. This allows to solve the enumerative problem for plane curves with two singular points of linear singularity types. In the general case this reduces the enumerative questions to the problem of collision of the two singular points. The meth...
متن کاملComputing Node Polynomials for Plane Curves
According to the Göttsche conjecture (now a theorem), the degree N of the Severi variety of plane curves of degree d with δ nodes is given by a polynomial in d, provided d is large enough. These “node polynomials” Nδ(d) were determined by Vainsencher and Kleiman–Piene for δ ≤ 6 and δ ≤ 8, respectively. Building on ideas of Fomin and Mikhalkin, we develop an explicit algorithm for computing all ...
متن کاملq-Floor Diagrams computing Refined Severi Degrees for Plane Curves
The Severi degree is the degree of the Severi variety parametrizing plane curves of degree d with δ nodes. Recently, Göttsche and Shende gave two refinements of Severi degrees, polynomials in a variable q, which are conjecturally equal, for large d. At q = 1, one of the refinements, the relative Severi degree, specializes to the (non-relative) Severi degree. We give a combinatorial description ...
متن کاملPolynomials Representing Eynard-orantin Invariants
The Eynard-Orantin invariants of a plane curve are multilinear differentials on the curve. For a particular class of genus zero plane curves these invariants can be equivalently expressed in terms of simpler expressions given by polynomials obtained from an expansion of the Eynard-Orantin invariants around a point on the curve. This class of curves contains many interesting examples.
متن کامل